Webpage Ranking Algorithms Second Exam Report
نویسندگان
چکیده
The traditional link analysis algorithms exploit the context information inherent in the hyperlink structure of the Web, with the premise being that a link from page A to page B denotes an endorsement of the quality of B. The exemplary PageRank algorithm weighs backlinks with a random surfer model; Kleinberg’s HITS algorithm promotes the use of hubs and authorities over a base set ; Lempel and Moran traverse this structure through their bipartite stochastic algorithm; Li examines the structure from head to tail, counting ballots over hypertext. Semantic Web and its inspired technologies bring new core factors into the ranking equation. While making continuous effort to improve the importance and relevancy of search results, Semantic ranking algorithms strive to improve the quality of search results: (1) The meaning of the search query; and (2) The relevancy of the result in relation to user’s intention. The survey focuses on an overview of eight selected search ranking algorithms.
منابع مشابه
Lecture 1 — January 3
1.1 Administrative details • Instructors: Aditya Gopalan ([email protected]), Parimal Parag ([email protected]) • Teaching assistant: Raghava GD ([email protected]) • Grading policy: Homework assignments (including programming exercises): 30%, Scribing lectures: 10%, Midterm exam: 20%, Final exam: 40% • Course webpage: www.ece.iisc.ernet.in/∼parimal/estimation.html • Sc...
متن کاملA User-Oriented Webpage Ranking Algorithm Based on User Attention Time
We propose a new webpage ranking algorithm which is personalized. Our idea is to rely on the attention time spent on a document by the user as the essential clue for producing the user-oriented webpage ranking. The prediction of the attention time of a new webpage is based on the attention time of other previously browsed pages by this user. To acquire the attention time of the latter webpages,...
متن کاملMapReduce Based Information Retrieval Algorithms for Efficient Ranking of Webpages
In this paper, the authors discuss the MapReduce implementation of crawler, indexer and ranking algorithms in search engines. The proposed algorithms are used in search engines to retrieve results from the World Wide Web. A crawler and an indexer in a MapReduce environment are used to improve the speed of crawling and indexing. The proposed ranking algorithm is an iterative method that makes us...
متن کاملEnabling Author-Centric Ranking of Web Content
In the past decade there has been a rapid increase in the amount of web content, partially due to wide-spread adoption of blogging and micro-blogging platforms that make it easy for ordinary users to quickly create web content. A single user may create content on many different online platforms or social networks. Current web search systems largely rely on link-structure of the web graph in ran...
متن کاملمدل جدیدی برای جستجوی عبارت بر اساس کمینه جابهجایی وزندار
Finding high-quality web pages is one of the most important tasks of search engines. The relevance between the documents found and the query searched depends on the user observation and increases the complexity of ranking algorithms. The other issue is that users often explore just the first 10 to 20 results while millions of pages related to a query may exist. So search engines have to use sui...
متن کامل